The amortized cost of finding the minimum
نویسندگان
چکیده
We obtain an essentially optimal tradeoff between the amortized cost of the three basic priority queue operations insert, delete and find-min in the comparison model. More specifically, we show that A(find-min) = Ω ( n (2 + )A(insert)+A(delete) )
منابع مشابه
Layered Heaps
We introduce a framework for reducing the number of comparisons performed in the deletion and minimum deletion operations for priority queues. In particular, we give a priority queue with constant cost per insertion and minimum finding, and logarithmic cost with at most logn + O(log logn) 1 comparisons per deletion and minimum deletion, improving over the bound of 2 logn + O(1) comparisons for ...
متن کاملFinding the Minimum Distance from the National Electricity Grid for the Cost-Effective Use of Diesel Generator-Based Hybrid Renewable Systems in Iran
The electricity economy and its excessive consumption have become one of the main concerns of the Iranian government for many years. This issue, along with recent droughts, shows the need to use renewable energy that is free and clean and does not require water. In addition, due to the high cost of cable-laying and maintenance of power lines, it is not at all an option at all distances over the...
متن کاملModeling adaptive node capture attacks in multi-hop wireless networks
We investigate the problem of modeling node capture attacks in heterogeneous wireless ad hoc and mesh networks. Classical adversarial models such as the Dolev–Yao model are known to be unsuitable for describing node capture attacks. By defining the amortized initialization overhead cost as well as the cost of capturing a node, we show that finding the node capture attack yielding the minimum co...
متن کاملPoly - Logarithmic Deterministic Fully - Dynamic GraphAlgorithms I : Connectivity and Minimum Spanning Tree
Deterministic fully dynamic graph algorithms are presented for con-nectivity and minimum spanning forest. For connectivity, starting with no edges, the amortized cost for maintaining a spanning forest is O(log 2 n) per update, i.e. per edge insertion or deletion. Deciding connectivity between any two given vertices is done in O(log n= log log n) time. This matches the previous best randomized b...
متن کاملINTEGRATING CASE-BASED REASONING, KNOWLEDGE-BASED APPROACH AND TSP ALGORITHM FOR MINIMUM TOUR FINDING
Imagine you have traveled to an unfamiliar city. Before you start your daily tour around the city, you need to know a good route. In Network Theory (NT), this is the traveling salesman problem (TSP). A dynamic programming algorithm is often used for solving this problem. However, when the road network of the city is very complicated and dense, which is usually the case, it will take too long fo...
متن کامل